r-TuBound: Loop Bounds for WCET Analysis (Tool Paper)
نویسندگان
چکیده
We describe the structure and the usage of a new software tool, called r-TuBound, for deriving symbolic loop iteration bounds in the worst-case execution time (WCET) analysis of programs. r-TuBound implements algorithms for pattern-based recurrence solving and program flow refinement, and it was successfully tested on a wide range of examples. The purpose of this article is to illustrate what r-TuBound can do and how it can be used to derive the WCET of programs.
منابع مشابه
An Evaluation of WCET Analysis using Symbolic Loop Bounds
In this paper we evaluate a symbolic loop bound generation technique recently proposed by the authors in [7]. The technique deploys pattern-based recurrence solving in conjunction with program flow refinement using SMT reasoning. The derived bounds are further used in the WCET analysis of programs with loops. This paper presents experimental evaluations of the method carried out with the r-TuBo...
متن کاملTuBound - A Conceptually New Tool for Worst-Case Execution Time Analysis
TUBOUND is a conceptually new tool for the worst-case execution time (WCET) analysis of programs. A distinctive feature of TUBOUND is the seamless integration of a WCET analysis component and of a compiler in a uniform tool. TUBOUND enables the programmer to provide hints improving the precision of the WCET computation on the high-level program source code, while preserving the advantages of us...
متن کاملTuBound - A Tool for Worst - Case Execution Time Analysis ∗
In this talk, we introduce TuBound, a tool to perform worst-case execution time (WCET) analysis. From the user’s perspective, TuBound is unique in that it operates on the source code level, which opens new possibilities for the usability and flexibility of the tool. In particular, TuBound supports high-level loop optimizations and the automatic analysis of loop bounds. The tool will be demonstr...
متن کاملPractical Experiments with Symbolic Loop Bound Computation for WCET Analysis1
We present an automatic method for computing tight upper bounds on the iteration number of special classes of program loops. These upper bounds are further used in the WCET analysis of programs. Program flow is refined using SMT reasoning, rewriting multi-path loops into single-path ones. Single-path loops are further translated into a set of recurrence relations over program variables. To solv...
متن کاملAbstracts of Presentations A Prospect to the Next Version of TuBound
s of Presentations A Prospect to the Next Version of TuBound Adrian Prantl Vienna University of Technology [email protected] The safety of our day-to-day life depends crucially on the correct functioning of embedded software systems which control the functioning of more and more technical devices. Many of these software systems are time-critical. Hence, computations performed need no...
متن کامل